Radio Labeling for Strong Product K3 ⊠ Pn

Some Applications of Strong Product

Let G and H be graphs. The strong product GH of graphs G and H is the graph with vertex set V(G)V(H) and u=(u1, v1) is adjacent with v= (u2, v2) whenever (v1 = v2 and u1 is adjacent with u2) or (u1 = u2 and v1 is adjacent with v2) or (u1 is adjacent with u2 and v1 is adjacent with v2). In this paper, we first collect the earlier results about strong product and then we present applications of ...

The Real Regulator for a Product of K3 Surfaces

Let X be a general complex algebraic K3 surface, and CH2(X, 1) Bloch’s higher Chow group ([Blo1]). In [C-L2] it is proven that the real regulator r2,1 : CH 2(X, 1)⊗ R→ H1,1(X,R) is surjective (Hodge-D-conjecture). The question addressed in this paper is whether a similar story holds for products of K3 surfaces. We prove a general regulator result for a product of two surfaces, and then deduce, ...

Metric packing for K3+K3

On global (strong) defensive alliances in some product graphs

A defensive alliance in a graph is a set $S$ of vertices with the property that every vertex in $S$ has at most one moreneighbor outside of $S$ than it has inside of $S$. A defensive alliance $S$ is called global if it forms a dominating set. The global defensive alliance number of a graph $G$ is the minimum cardinality of a global defensive alliance in $G$. In this article we study the global ...

Product Cordial Labeling for Some New Graphs

Received: December 16, 2010 Accepted: December 31, 2010 doi:10.5539/jmr.v3n2p206 Abstract In this paper we investigate product cordial labeling for some new graphs. We prove that the friendship graph, cycle with one chord (except when n is even and the chord joining the vertices at diameter distance), cycle with twin chords (except when n is even and one of the chord joining the vertices at dia...